- disjoint clusters
- pl.неперекрывающиеся (абонентские) группы; (абонентские) группы с неперекрывающимися зонами обслуживания; см. cluster 1
Англо-русский словарь промышленной и научной лексики. 2014.
disjoint clusters
Смотреть что такое "disjoint clusters" в других словарях:
IBM General Parallel File System — Infobox Software name = IBM GPFS caption = developer = IBM latest release version = 3.2.1 6 latest release date = September 2008 operating system = AIX / Linux / Microsoft Windows Server 2003 R2 genre = filesystem license = Proprietary website =… … Wikipedia
Carrier language — Carrier Dakeł (ᑕᗸᒡ) Spoken in Canada Region Central Interior of British Columbia Ethnicity Carrier people Nati … Wikipedia
Mathematics of Sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N}), so that each … Wikipedia
Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue … Wikipedia
Nearest-neighbor chain algorithm — In the theory of cluster analysis, the nearest neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be… … Wikipedia
Single-linkage clustering — In cluster analysis, single linkage, nearest neighbour or shortest distance is a method of calculating distances between clusters in hierarchical clustering. In single linkage, the distance between two clusters is computed as the distance between … Wikipedia
Complete-linkage clustering — In cluster analysis, complete linkage or farthest neighbour is a method of calculating distances between clusters in agglomerative hierarchical clustering. In complete linkage,[1] the distance between two clusters is computed as the maximum… … Wikipedia
Tandem Computers — A Tandem Computers promotional mug Tandem Computers, Inc. was the dominant manufacturer of fault tolerant computer systems for ATM networks, banks, stock exchanges, telephone switching centers, and other similar commercial transaction processing… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Turán graph — The Turán graph T(13,4) Named after Pál Turán v · … Wikipedia
Locality of reference — In computer science, locality of reference, also known as the principle of locality, is the phenomenon of the same value or related storage locations being frequently accessed. There are two basic types of reference locality. Temporal locality… … Wikipedia
